Experimental Realization of Simon’s Problem Functions in a One-way Quantum Computer
نویسندگان
چکیده
M. S. Tame,1, 2, ∗ B. A. Bell,3 C. Di Franco,4 W. J. Wadsworth,5 and J. G. Rarity3 1University of KwaZulu-Natal, School of Chemistry and Physics, 4001 Durban, South Africa 2National Institute for Theoretical Physics, University of KwaZulu-Natal,Durban 4001, South Africa 3Photonics Group, Department of Electrical and Electronic Engineering, University of Bristol, Merchant Venturers Building, Woodland Road, Bristol, BS8 1UB, UK 4Quantum Optics and Laser Science Group, Imperial College London, Blackett Laboratory, SW7 2AZ London, UK 5CPPM, Department of Physics, University of Bath, Claverton Down, Bath, BA2 7AY, UK (Dated: September 19, 2014)
منابع مشابه
Optimal Separation in Exact Query Complexities for Simon's Problem
Simon’s problem is one of the most important problems demonstrating the power of quantum computers, which achieves a large separation between quantum and classical query complexities. However, Simon’s discussion on his problem was limited to bounded-error setting, which means his algorithm can not always get the correct answer. Exact quantum algorithms for Simon’s problem have also been propose...
متن کاملAn Exact Quantum Polynomial-Time Algorithm for Simon's Problem
We investigate the power of quantum computers when they are required to return an answer that is guaranteed to be correct after a time that is upper-bounded by a polynomial in the worst case. We show that a natural generalization of Simon’s problem can be solved in this way, whereas previous algorithms required quantum polynomial time in the expected sense only, without upper bounds on the wors...
متن کاملEfficient classical simulation of the Deutsch-Jozsa and Simon's algorithms
A long-standing aim of quantum information research is to understand what gives quantum computers their advantage. This requires separating problems that need genuinely quantum resources from those for which classical resources are enough. Two examples of quantum speed-up are the Deutsch–Jozsa and Simon’s problem, both efficiently solvable on a quantum Turing machine, and both believed to lack ...
متن کاملExperimental realization of a quantum game on a one-way quantum computer
We report the first demonstration of a quantum game on an all-optical one-way quantum computer. Following a recent theoretical proposal we implement a quantum version of Prisoner’s Dilemma, where the quantum circuit is realized by a 4-qubit box-cluster configuration and the player’s local strategies by measurements performed on the physical qubits of the cluster. This demonstration underlines t...
متن کاملBQIABC: A new Quantum-Inspired Artificial Bee Colony Algorithm for Binary Optimization Problems
Artificial bee colony (ABC) algorithm is a swarm intelligence optimization algorithm inspired by the intelligent behavior of honey bees when searching for food sources. The various versions of the ABC algorithm have been widely used to solve continuous and discrete optimization problems in different fields. In this paper a new binary version of the ABC algorithm inspired by quantum computing, c...
متن کامل